Representing Arc Labels in Dna Algorithms

نویسنده

  • Ajit Narayanan
چکیده

DNA computing has recently generated much interest as a result of pioneering work by Adleman and Lipton, who described DNA algorithms for solving problems considered NP-hard by computer scientists. Their DNA algorithms worked on graph representations of the problem, but no indication was provided about how information on the arcs between nodes on a graph could be handled. The aim of this paper is extend the basic DNA algorithmic techniques of Adleman and Lipton by demonstrating a method for representing simple arc information | in this case, distances between cities in a simple map. The work described here signiicantly advances our understanding of DNA computational processes and identiies the potential for DNA algorithms for addressing problems in the NP class. 1 Adleman's DNA computing solution for HPP Consider the map presented in Figure 1, which describes the way that ve cities are linked by one-way and two-way roads. Adleman's (1994) approach was to encode each city and each route between two cities in 5 1 2 3 4 Figure 1: A map denoting the one-way and two-way roads between 5 cities. The task is for a travelling salesperson to visit each city once, starting at city 1. The only route is cities 1, 2, 3, 4 and 5. Adleman's (1994) DNA computation (using a slightly diierent version of the problem involving 7 cities and strands for cities of 20 bases in length) took 7 days to perform. DNA strands, and put them into a test-tube. For example, the strand coding for cities 1 and 2 could be AATGCCGG and TTTAAGCC, respectively. A road from city 1 to 2 is encoded in such a way that the rst part is the complementary strand 1 to the second half of strand for city 1, and the second part is 1 What is remarkable is that the DNA are large molecules made up of combinations of only four types of nucleotides | adenine, guanine, thymine and cytosine (called A, G, T, and C, respectively). It is estimated that the DNA in each one of our cells contains about 8 billion nucleotides, spread across 46 chromosomes (discrete molecular structures of DNA), each of

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel Intrusion Detection Systems based on Genetic Algorithms-suggested Features by the Means of Different Permutations of Labels’ Orders

Intrusion detection systems (IDS) by exploiting Machine learning techniques are able to diagnose attack traffics behaviors. Because of relatively large numbers of features in IDS standard benchmark dataset, like KDD CUP 99 and NSL_KDD, features selection methods play an important role. Optimization algorithms like Genetic algorithms (GA) are capable of finding near-optimum combination of the fe...

متن کامل

A Contour Tracing Algorithm that Avoids Duplicate Tracing Common Boundaries between Regions

The authors of this paper have developed a series of techniques on automatic function approximation of raster images, including references [3] and [5] that were published in this journal. In our techniques, contours are traced and their shapes are approximated by a combination of functions including straight line, arc, and quadratic curve. Because our previous works targeted mainly bi...

متن کامل

Deterministic Dependency Parsing of English Text

This paper presents a deterministic dependency parser based on memory-based learning, which parses English text in linear time. When trained and evaluated on the Wall Street Journal section of the Penn Treebank, the parser achieves a maximum attachment score of 87.1%. Unlike most previous systems, the parser produces labeled dependency graphs, using as arc labels a combination of bracket labels...

متن کامل

A Dynamic Confusion Score for Dependency Arc Labels

In this paper we propose an approach to dynamically compute a confusion score for dependency arc labels, in typed dependency parsing framework. This score accompanies the parsed output and aims to administer an informed account of parse correctness, detailed down to each edge of the parse. The methodology explores the confusion encountered by the oracle of a data driven parser, in predicting an...

متن کامل

High-Dimensional Unsupervised Active Learning Method

In this work, a hierarchical ensemble of projected clustering algorithm for high-dimensional data is proposed. The basic concept of the algorithm is based on the active learning method (ALM) which is a fuzzy learning scheme, inspired by some behavioral features of human brain functionality. High-dimensional unsupervised active learning method (HUALM) is a clustering algorithm which blurs the da...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997